Cut equivalence of d-dimensional guillotine partitions

نویسندگان

  • Andrei Asinowski
  • Gill Barequet
  • Toufik Mansour
  • Ron Y. Pinter
چکیده

A guillotine partition of a d-dimensional axis-aligned box B is a recursive partition of B by axis-aligned hyperplane cuts. The size of a guillotine partition is the number of boxes it contains. Two guillotine partitions are box-equivalent if their boxes satisfy compatible order relations with respect to the axes. (In many works, box-equivalent guillotine partitions are considered identical.) In the present work we define cut-equivalence of guillotine partitions, derived in a similar way from order relations of cuts. We prove structural properties related to these kinds of equivalence, and enumerate cut-equivalence classes of d-dimensional guillotine partitions of size n. AMS classification codes: 05A15, 05A16, 05C30, 11B37.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Separable d-Permutations and Guillotine Partitions

We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula, and explicit formula. We find a connection between multidimensional permutations and guillotine partitions of a box. In particular, a bijection between separable d-dimensional permutations and guillotine partitions of a 2d−1-dimensional bo...

متن کامل

Iterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem

An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...

متن کامل

The number of guillotine partitions in d dimensions

Guillotine partitions play an important role in many research areas and application domains, e.g., computational geometry, computer graphics, integrated circuit layout, and solid modeling, to mention just a few. In this paper we present an exact summation formula for the number of structurally-different guillotine partitions in d dimensions by n hyperplanes, and then show that it is Θ (( 2d− 1 ...

متن کامل

Polychromatic Colorings of n-Dimensional Guillotine-Partitions

A strong hyperbox-respecting coloring of an n-dimensional hyperbox partition is a coloring of the corners of its hyperboxes with 2n colors such that any hyperbox has all the colors appearing on its corners. A guillotine-partition is obtained by starting with a single axis-parallel hyperbox and recursively cutting a hyperbox of the partition into two hyperboxes by a hyperplane orthogonal to one ...

متن کامل

An algorithm for the guillotine restrictions verification in a rectangular covering model

We consider the Cutting and Covering problem with guillotine restrictions. In one of our previous works, we have shown the connection between the connex components of a graph representation for the covering model and the guillotine cuts. Based on this, in this paper we propose an algorithm which can be used to verify guillotine restrictions in a two-dimensional covering model. Key–Words: bidime...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 331  شماره 

صفحات  -

تاریخ انتشار 2014